skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Micheli, Giacomo"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Journal of Number Theory)
    Free, publicly-accessible full text available July 1, 2026
  2. ; (, La Matematica)
    Free, publicly-accessible full text available June 1, 2026
  3. ; ; ; (, Designs, Codes and Cryptography)
    Free, publicly-accessible full text available April 5, 2026
  4. ; ; ; ; (, Journal of Algebra and Its Applications)
    Let [Formula: see text] be a prime power and [Formula: see text]. In this paper we complete the classification of good polynomials of degree [Formula: see text] that achieve the best possible asymptotics (with an explicit error term) for the number of totally split places. Moreover, for degrees up to [Formula: see text], we provide an explicit lower bound and an asymptotic estimate for the number of totally split places of [Formula: see text]. Finally, we prove the general fact that the number [Formula: see text] of [Formula: see text] for which [Formula: see text] splits obeys a linear recurring sequence. For any [Formula: see text], this allows for the computation of [Formula: see text] for large [Formula: see text] by only computing a recurrence sequence over [Formula: see text]. 
    more » « less
    Free, publicly-accessible full text available March 25, 2026
  5. ; ; (, Springer Nature Switzerland)
    Free, publicly-accessible full text available January 1, 2026
  6. ; ; (, Designs, Codes and Cryptography)
    Free, publicly-accessible full text available December 27, 2025
  7. ; (, Journal of Algebra)
    Full Text Available 
  8. ; ; (, IEEE Transactions on Information Theory)
    Full Text Available 
  9. ; ; (, Journal of Algebra and Its Applications)
    In this paper, we give constructions for infinite sequences of finite nonlinear locally recoverable codes [Formula: see text] over a product of finite fields arising from basis expansions in algebraic number fields. The codes in our sequences have increasing length and size, constant rate, fixed locality, and minimum distance going to infinity. 
    more » « less
    Full Text Available 
  10. ; (, IEEE International Symposium on Information Theory)